Weakly almost square Lipschitz-free spaces
نویسندگان
چکیده
We construct a Lipschitz-free space that is locally almost square but not weakly square; this the first example of such Banach space. also prove result, which indicates geodesic metric spaces are potential characterization for spaces. Lastly, we can have symmetric strong diameter 2 property.
منابع مشابه
Lipschitz - free Banach spaces
We show that when a linear quotient map to a separable Banach space X has a Lipschitz right inverse, then it has a linear right inverse. If a separable space X embeds isometrically into a Banach space Y , then Y contains an isometric linear copy of X. This is false for every nonseparable weakly compactly generated Banach space X. Canonical examples of nonseparable Banach spaces which are Lipsch...
متن کاملSome Remarks on Almost Menger Spaces and Weakly Menger Spaces
{V : V ∈ Vn} = X . Clearly, every Menger space is almost Menger and every almost Menger space is weakly Menger, but the converses do not hold (see Examples 2.1 and 2.2). On the study of weakly Menger spaces, almost Menger spaces and Menger spaces, the readers can see the references [2, 3, 4, 5, 6]. Here we investigate the relationships among almost Menger spaces, weakly Menger spaces and Menger...
متن کاملWeakly almost periodic functionals, representations, and operator spaces
A theorem of Davis, Figiel, Johnson and Pe lczyński tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method, which has been adapted to the category of operator spaces by Xu, showing the this factorisation result also holds for completely bounded weakly-compact maps. In this...
متن کاملAlmost Online Square Packing
In the square packing problem, the goal is to pack squares of different sizes into the smallest number of bins (squares) of uniform size. We introduce an almostonline square packing algorithm which places squares in an online, sequential manner. In doing so, it receives advice of logarithmic size from an offline oracle which runs in linear time. Our algorithm achieve a competitive ratio of at m...
متن کاملAlmost Square Packing
The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle with minimal area. This extends the previously studied square packing problem by adding an additional degree of freedom for each rectangle, deciding in which orientation the item should be packed. We show how to extend the model and search stra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2023
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2023.127339